Mixing of quantum walk on circulant bunkbeds

نویسندگان

  • Peter Lo
  • Siddharth Rajaram
  • Diana Schepens
  • Daniel Sullivan
  • Christino Tamon
  • Jeffrey Ward
چکیده

We give new observations on the mixing dynamics of a continuous-time quantum walk on circulants and their bunkbed extensions. These bunkbeds are defined through two standard graph operators: the join G + H and the Cartesian product G ⊕ H of graphs G and H . Our results include the following: • The quantum walk is average uniform mixing on circulants with bounded eigenvalue multiplicity. This extends a known fact about the cycles Cn. • Explicit analysis of the probability distribution of the quantum walk on the join of circulants. This explains why complete partite graphs are not average uniform mixing, using the fact Kn = K1 +Kn−1 and Kn,...,n = Kn + . . .+Kn. • The quantum walk on the Cartesian product of am-vertex path Pm and a circulant G, namely, Pm ⊕G, is average uniform mixing if G is. This highlights a difference between circulants and the hypercubes Qn = P2 ⊕Qn−1. Our proofs employ purely elementary arguments based on the spectra of the graphs.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Non-uniform mixing of quantum walk on cycles

A classical lazy random walk on cycles is known to mix to the uniform distribution. In contrast, we show that a continuous-time quantum walk on cycles exhibit strong non-uniform mixing properties. Our results include the following: • The instantaneous distribution of a quantum walk on most even-length cycles is never uniform. More specifically, we prove that a quantum walk on a cycle Cn is not ...

متن کامل

Mixing in Continuous Quantum Walks on Graphs

Classical random walks on well-behaved graphs are rapidly mixing towards the uniform distribution. Moore and Russell showed that a continuous quantum walk on the hypercube is instantaneously uniform mixing. We show that the continuous-time quantum walks on other well-behaved graphs do not exhibit this uniform mixing. We prove that the only graphs amongst balanced complete multipartite graphs th...

متن کامل

Non-uniform Mixing in Continuous Quantum Walks

In this note, we study the mixing properties of continuous-time quantum random walks on graphs. We prove that the only graphs in the family of balanced complete multipartite graphs that have a uniform mixing property are K2, K3, K4, and K2,2. This is unlike the classical case where the uniform mixing property is satisfied by all such graphs. Our proof exploits the circulant structure of these g...

متن کامل

Universal mixing of quantum walk on graphs

We study the set of probability distributions visited by a continuous-time quantum walk on graphs. An edge-weighted graph G is universal mixing if the instantaneous or average probability distribution of the quantum walk on G ranges over all probability distributions on the vertices as the weights are varied over non-negative reals. The graph is uniform mixing if it visits the uniform distribut...

متن کامل

ua nt - p h / 06 08 04 4 v 1 4 A ug 2 00 6 Universal Mixing of Quantum Walk on Graphs ∗

We study the set of probability distributions visited by a continuous-time quantum walk on graphs. An edge-weighted graph G is universal mixing if the instantaneous or average probability distribution of the quantum walk on G ranges over all probability distributions on the vertices as the weights are varied over non-negative reals. The graph is uniform mixing if it visits the uniform distribut...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Quantum Information & Computation

دوره 6  شماره 

صفحات  -

تاریخ انتشار 2006